A NEW MODELLING FOR THE AIRCRAFT LANDING PROBLEM AND MATHEURISTIC APPROACH TO SOLVE THE PROBLEM WITH A LARGE NUMBER OF AIRCRAFT

Air traffic management has become increasingly complex due to the increasing use of air transport. One main bottlenecks is planning efficient runways for takeoff and landing. This paper aims investigate Aircraft Landing Problem, which seeks minimize earliness tardiness in aircraft landing time, assigning them a runway land sequencing them. A new mathematical formulation based on Job Shop was proposed problem, comparing it with four formulations literature; three directly comparable another containing particularity that does not allow direct comparison other formulations. Computational tests were performed 49 instances literature using Gurobi Optimizer optimization package. These commonly used ALP present difficulties finding optimal solution when number large, i.e., more than 50 aircraft. Therefore, we matheuristic solve greater cannot optimally. first finds an initial relax-and-fix (RF) then fix-and-optimize (FO) improves found solution. Comparisons also made feasible obtained by improved FO. Among variations, one best result combination RF FO this showed efficiency relation work uses